Double perfect partitions
نویسندگان
چکیده
منابع مشابه
Star Partitions of Perfect Graphs
The partition of graphs into nice subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into stars, a problem known to be NP-complete even for the case of stars on three vertices. We perform a thorough computational complexity study of the problem on subclasses of perfect graphs and identify several polynomial-time solvabl...
متن کاملMatrix partitions of perfect graphs
Given a symmetric m by m matrix M over 0, 1, ∗, the M -partition problem asks whether or not an input graph G can be partitioned into m parts corresponding to the rows (and columns) of M so that two distinct vertices from parts i and j (possibly with i = j) are nonadjacent if M(i, j) = 0, and adjacent if M(i, j) = 1. These matrix partition problems generalize graph colourings and homomorphisms,...
متن کاملSkew partitions in perfect graphs
We discuss some new and old results about skew partitions in perfect graphs. © 2007 Published by Elsevier B.V.
متن کاملFinding balanced skew partitions in perfect graphs
A graph G is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one; and it is known that this is equivalent to being perfect, that is, that the chromatic number of every induced subgraph equals the size of its largest clique. A skew partition in G is a partition (A,B) of V (G) such that G[A] is not connected and G[B] is not connected; and it is balan...
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2006
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.01.007